Efficient Codes for Adversarial Wiretap Channels
نویسندگان
چکیده
In [13] we proposed a (ρr, ρw)-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction ρr of the codeword sent over the channel, and modify a fraction ρw of the codeword by adding arbitrary noise values to them. In this paper we give the first efficient construction of a capacity achieving code family that provides perfect secrecy for this channel.
منابع مشابه
A Model for Adversarial Wiretap Channel
In wiretap model of secure communication, the goal is to provide (asymptotic) perfect secrecy and reliability over a noisy channel that is eavesdropped by an adversary with unlimited computational power. This goal is achieved by taking advantage of the channel noise and without requiring a shared key. The model has attracted considerable attention in recent years because it captures eavesdroppi...
متن کاملAlmost universal codes for MIMO wiretap channels
Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information theoretically secure codes over such channels remains as an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. We extend the flatness factor criterion...
متن کاملCapacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
ABSTRACT In this paper, we investigate the limitations of capacity-based random code constructions for the wiretap channel, i.e., constructions that associate to each confidential message a subcode whose rate approaches the capacity of the eavesdropper’s channel. Generalizing a previous result for binary symmetric channels, we show that random capacity-based codes do not achieve the strong secr...
متن کاملWiretap lattice codes from number fields with no small norm elements
We consider the problem of designing reliable and confidential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for finite lattice constellations a finite sum of inverse of algebraic norms, in fact the analogous for finite sums of the known criterion for infinite constellations, which motivates us to study totally real number fields w...
متن کاملWiretap and Gelfand-Pinsker Channels Analogy and its Applications
A framework of analogy between wiretap channels (WTCs) and state-dependent point-to-point channels with noncausal encoder channel state information (referred to as Gelfand-Pinker channels (GPCs)) is proposed. A good (reliable and secure) sequence of wiretap codes is shown to induce a good (reliable) sequence of codes for a corresponding GPC. Consequently, the framework enables exploiting existi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.4633 شماره
صفحات -
تاریخ انتشار 2014